A Modified Precondition in the Gauss-Seidel Method
نویسندگان
چکیده
منابع مشابه
Convergence and Comparison Theorems of the Modified Gauss-Seidel Method
In this paper, the modified Gauss-Seidel method with the new preconditioner for solving the linear system Ax = b, where A is a nonsingular M -matrix with unit diagonal, is considered. The convergence property and the comparison theorems of the proposed method are established. Two examples are given to show the efficiency and effectiveness of the modified Gauss-Seidel method with the presented n...
متن کاملA Review of Preconditioners for the Interval Gauss – Seidel Method
Interval Newton methods in conjunction with generalized bisection can form the basis of algorithms that find all real roots within a specified box X ⊂ Rn of a system of nonlinear equations F (X) = 0 with mathematical certainty, even in finite-precision arithmetic. In such methods, the system F (X) = 0 is transformed into a linear interval system 0 = F (M) + F′(X)(X̃ −M); if interval arithmetic i...
متن کاملOn Preconditioners and Splitting in the Interval Gauss–seidel Method
Finding bounding sets to solutions to systems of algebraic equations with uncertainties in the coefficients, as well as finding mathematically rigorous but rapid location of all solutions to nonlinear systems or finding global optima, involves bounding the solution sets to systems of equations with wide interval coefficients. The interval Gauss–Seidel algorithm has various properties that make ...
متن کاملD-iteration method or how to improve Gauss-Seidel method
The aim of this paper is to present the recently proposed fluid diffusion based algorithm in the general context of the matrix inversion problem associated to the Gauss-Seidel method. We explain the simple intuitions that are behind this diffusion method and how it can outperform existing methods. Then we present some theoretical problems that are associated to this representation as open resea...
متن کاملPaving the Randomized Gauss-Seidel
The Randomized Gauss-Seidel Method (RGS) is an iterative algorithm that solves overdetermined systems of linear equations Ax = b. This paper studies an update on the RGS method, the Randomized Block Gauss-Seidel Method(RBGS). At each step, the algorithm greedily minimizes the objective function L(x) = kAx bk2 with respect to a subset of coordinates. This paper describes a Randomized Block Gauss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Linear Algebra & Matrix Theory
سال: 2012
ISSN: 2165-333X,2165-3348
DOI: 10.4236/alamt.2012.23005